1476B - Inflation - CodeForces Solution


binary search brute force greedy math *1300

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
int main(){
    int t;
    scanf("%d", &t);
    while(t--){
        long long n, k, sum;
        scanf("%lld %lld %lld", &n, &k, &sum);
        long long ans = 0;
        for(int i = 1; i < n; i++){
            long long x;
            scanf("%lld", &x);
            if(sum * k < x * 100){
                long long o = (x * 100 + k - 1) / k - sum;
                ans += o;
                sum += o;
            }
            sum += x;
        }
        printf("%lld\n", ans);
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1372B - Omkar and Last Class of Math
1025D - Recovering BST
439A - Devu the Singer and Churu the Joker
1323A - Even Subset Sum Problem
1095A - Repeating Cipher
630F - Selection of Personnel
630K - Indivisibility
20B - Equation
600B - Queries about less or equal elements
1015A - Points in Segments
1593B - Make it Divisible by 25
680C - Bear and Prime 100
1300A - Non-zero
1475E - Advertising Agency
1345B - Card Constructions
1077B - Disturbed People
653A - Bear and Three Balls
794A - Bank Robbery
157A - Game Outcome
3B - Lorry
1392A - Omkar and Password
489A - SwapSort
932A - Palindromic Supersequence
433A - Kitahara Haruki's Gift
672A - Summer Camp
1277A - Happy Birthday Polycarp
577A - Multiplication Table
817C - Really Big Numbers
1355A - Sequence with Digits
977B - Two-gram